Canonicity and homotopy canonicity for cubical type theory
نویسندگان
چکیده
Cubical type theory provides a constructive justification of homotopy theory. A crucial ingredient cubical is path lifting operation which explained computationally by induction on the involving several non-canonical choices. We present in this article two canonicity results, both proved sconing argument: result, every natural number equal to numeral, even if we take away equations defining structure, and uses these way. Both proofs are done internally presheaf model.
منابع مشابه
Canonicity for Cubical Type Theory
Cubical type theory is an extension of Martin-Löf type theory recently proposed by Cohen, Coquand, Mörtberg and the author which allows for direct manipulation of n-dimensional cubes and where Voevodsky’s Univalence Axiom is provable. In this paper we prove canonicity for cubical type theory: any natural number in a context build from only name variables is judgmentally equal to a numeral. To a...
متن کاملUnivalence for inverse diagrams and homotopy canonicity
We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory. This has two main applications. First, by considering inverse diagrams in Voevodsky...
متن کاملCanonicity!
We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. This leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms – in this general framework – leads to completeness or saturation. The method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.
متن کاملGround Canonicity
They are not capable to ground a canonicity of universal consistency. Abstract We explore how different proof orderings induce different notions of saturation. We relate completion, paramodulation, saturation, redundancy elimination, and rewrite system reduction to proof orderings.
متن کاملNeighborhoods, Ultrafilters, and Canonicity
This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce “ultrafilter semantics,” a way of expressing all sets over a canonical frame in an ‘effable’ way. This provides us with a conceptually easy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2022
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-18(1:28)2022